Compact Rectilinear Grids for the Ray Tracing of Irregular Scenes
نویسندگان
چکیده
Regular grid spatial subdivision is frequently used for fast ray tracing of scanned models. Scanned models feature regular sized primitives, with a regular spatial distribution. Grids have worse performance, than other subdivision techniques, for irregular models without these characteristics. We propose a method to improve the performance of grids for rendering irregular scenes by allowing the individual placement of grid split planes: the rectilinear grid. We describe how to construct and traverse a rectilinear grid. To exploit cache memory in modern processors compression is used for the split plane and grid cell data. We demonstrate in a series of tests that the method has faster ray tracing rendering performance than a compressed regular grid of similar dimensions.
منابع مشابه
A Survey on Exploiting Grids for Ray Tracing
Grid is one of the first data structure introduced at the very beginning of computer graphics. Grids are used in several applications of computer graphics, especially in rendering algorithms. Lately, in ray tracing dynamic scenes, grid has received attention for its appealing linear time building time. In this paper, we aim to survey several aspects behind the use of grids in ray tracing. In pa...
متن کاملGPU Ray Tracing using Irregular Grids
We present a spatial index structure to accelerate ray tracing on GPUs. It is a flat, non-hierarchical spatial subdivision of the scene into axis aligned cells of varying size. In order to construct it, we first nest an octree into each cell of a uniform grid. We then apply two optimization passes to increase ray traversal performance: First, we reduce the expected cost for ray traversal by mer...
متن کاملTwo-Level Grids for Ray Tracing on GPUs
We investigate the use of two-level nested grids as acceleration structure for ray tracing of dynamic scenes. We propose a massively parallel, sort-based construction algorithm and show that the two-level grid is one of the structures that is fastest to construct on modern graphics processors. The structure handles non-uniform primitive distributions more robustly than the uniform grid and its ...
متن کاملFast Ray-Tracing of Rectilinear Volume Data Using Distance Transforms
ÐThis paper discusses and experimentally compares distance-based acceleration algorithms for ray-tracing of volumetric data with an emphasis on the Chessboard Distance (CD) voxel traversal. The acceleration of this class of algorithms is achieved by skipping empty macro regions, which are defined for each background voxel of the volume. Background voxels are labeled in a preprocessing phase by ...
متن کاملEfficient ray tracing of complex natural scenes*
In this paper we present a method for the consistent modelling and efficient ray tracing of complex natural scenes. Both plants and terrains are modelled and represented in the same way to allow mutual influences of their appearance and interdependencies of their geometry. Plants are generated together with a fractal terrain, so that they directly grow on it. This allows an accurate calculation...
متن کامل